On integer Chebyshev polynomials
نویسندگان
چکیده
We are concerned with the problem of minimizing the supremum norm on [0, 1] of a nonzero polynomial of degree at most n with integer coefficients. We use the structure of such polynomials to derive an efficient algorithm for computing them. We give a table of these polynomials for degree up to 75 and use a value from this table to answer an open problem due to P. Borwein and T. Erdélyi and improve a lower bound due to Flammang et al.
منابع مشابه
Polynomials with integer coefficients and their zeros
We study several related problems on polynomials with integer coefficients. This includes the integer Chebyshev problem, and the Schur problems on means of algebraic numbers. We also discuss interesting applications to the approximation by polynomials with integer coefficients, and to the growth of coefficients for polynomials with roots located in prescribed sets. The distribution of zeros for...
متن کاملThe Multivariate Integer Chebyshev Problem
The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in C. We study this problem on general sets, but devote special attention to product sets such as cube and polydisk. We also establish a multivariate analog of the Hilbert-Fekete upper bound for the integer Chebyshev constant, which depends on the dimens...
متن کاملSome Identities and a Matrix Inverse Related to the Chebyshev Polynomials of the Second Kind and the Catalan Numbers
In the paper, the authors establish two identities to express higher order derivatives and integer powers of the generating function of the Chebyshev polynomials of the second kind in terms of integer powers and higher order derivatives of the generating function of the Chebyshev polynomials of the second kind respectively, find an explicit formula and an identity for the Chebyshev polynomials ...
متن کاملBlind Signature Scheme Based on Chebyshev Polynomials
A blind signature scheme is a cryptographic protocol to obtain a valid signature for a message from a signer such that signer’s view of the protocol can’t be linked to the resulting message signature pair. This paper presents blind signature scheme using Chebyshev polynomials. The security of the given scheme depends upon the intractability of the integer factorization problem and discrete loga...
متن کاملSmall Polynomials with Integer Coefficients
The primary goal of this paper is the study of polynomials with integer coefficients that minimize the sup norm on the set E. In particular, we consider the asymptotic behavior of these polynomials and of their zeros. Let Pn(C) and Pn(Z) be the classes of algebraic polynomials of degree at most n, respectively with complex and with integer coefficients. The problem of minimizing the uniform nor...
متن کاملChebyshev Polynomials and Primality Tests
Algebraic properties of Chebyshev polynomials are presented. The complete factorization of Chebyshev polynomials of the rst kind (Tn(x)) and second kind (Un(x)) over the integers are linked directly to divisors of n and n + 1 respectively. For any odd integer n, it is shown that the polynomial Tn(x)=x is irreducible over the integers i n is prime. The result leads to a generalization of Fermat'...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 66 شماره
صفحات -
تاریخ انتشار 1997